Survivable Network Slicing using Shared Link Protection
نویسندگان
چکیده
In optical metro-aggregation networks, logical partitioning or network slicing can enforce the high reliability required by advanced services. This be achieved enabling flexible resource management. Virtual functions composing a slice deployed over physical nodes using different strategies. reliable slicing, virtual request involves allocating link-disjoint primary and backup resources to protect against single link failure. this paper, we present embedding algorithm elastic networks considering shared protection (SLP). is reduce resources. We propose heuristic SLP mapping that enables multiplexing of S links share same on given link, offering improved utilization. extend our proposed represented matrices. These matrices define sharing as well capacity. shown perform remarkably better than dedicated allows efficient wavelength channel utilization reducing needed for up 37%.
منابع مشابه
Survivable Probability of Network Slicing with Random Physical Link Failure
The fifth generation of communication technology (5G) revolutionizes mobile networks and the associated ecosystems through the integration of cross-domain networks. Network slicing is an enabling technology for 5G as it provides dynamic, on-demand, and reliable logical network slices (i.e., network services) over a common physical network/infrastructure. Since a network slice is subject to fail...
متن کاملProvisioning Algorithms in Survivable Optical Networks with Shared Protection
The efficient use of network capacity strongly depends upon the path selection procedure. In this paper we propose and evaluate efficient path selection algorithms for survivable optical networks with shared protection. Two distributed path selection algorithms are presented. The first approach maintains global information on network resource usage to determine link sharability and compute opti...
متن کاملTraffic grooming for survivable WDM networks - shared protection
This paper investigates the survivable trafficgrooming problem for optical mesh networks employing wavelength-division multiplexing (WDM). In the dynamic-provisioning context, a typical connection request may require bandwidth less than that of a wavelength channel, and it may also require protection from network failures, typically fiber cuts. Based on a generic grooming-node architecture, we ...
متن کاملDemand-wise Shared Protection revisited: A new model for survivable network design∗
In this article, a new integer linear programming model for the end-to-end survivability concept Demand-wise Shared Protection (dsp) is presented. dsp is based on the idea that backup capacity is dedicated to a particular demand, but shared within a demand. It combines advantages of dedicated and shared protection: It is more cost-efficient than dedicated protection and operationally easier tha...
متن کاملSegment shared protection for survivable meshed WDM optical networks
In this paper, we investigate the protection design for survivable meshed WDM optical networks, and propose a novel heuristic algorithm, which is called segment shared protection (SSP), to completely protect the dual-link failures. For each connection request, first SSP computes a least-cost working path, second SSP divides the working path into several un-overlapped segment paths according to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3301173